Metatheory and Re ection in Theorem Proving: A Survey and Critique

نویسنده

  • John Harrison
چکیده

One way to ensure correctness of the inference performed by computer theorem provers is to force all proofs to be done step by step in a simple, more or less traditional, deductive system. Using techniques pioneered in Edinburgh LCF, this can be made palatable. However, some believe such an approach will never be eecient enough for large, complex proofs. One alternative, commonly called reeection, is to analyze proofs using a second layer of logic, a metalogic, and so justify abbreviating or simplifying proofs, making the kinds of shortcuts humans often do or appealing to specialized decision algorithms. In this paper we contrast the fully-expansive LCF approach with the use of reeection. We put forward arguments to suggest that the inadequacy of the LCF approach has not been adequately demonstrated, and neither has the practical utility of reeection (notwithstanding its undoubted intellectual interest). The LCF system with which we are most concerned is the HOL proof assistant. The plan of the paper is as follows. We examine ways of providing user ex-tensibility for theorem provers, which naturally places the LCF and reeective approaches in opposition. A detailed introduction to LCF is provided, emphasizing ways in which it can be made eecient. Next, we present a short introduction to metatheory and its usefulness, and, starting from GG odel's proofs and Feferman's transsnite progressions of theories, look at logicaìreeection principles'. We show how to introduce computationaìreeection principles' which do not extend the power of the logic, but may make deductions in it more eecient, and speculate about their practical usefulness. Applications or proposed applications of computational reeection in theorem proving are surveyed, following which we draw some conclusions. In an appendix, we attempt to clarify a couple of other notions of`reeection' often encountered in the literature. The paper questions the too-easy acceptance of reeection principles as a practical necessity. However I hope it also serves as an adequate introduction to the concepts involved in reeection and a survey of relevant work. To this end, a rather extensive bibliography is provided.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalization of Titchmarsh's Theorem for the Dunkl Transform

Using a generalized spherical mean operator, we obtain a generalization of Titchmarsh's theorem for the Dunkl transform for functions satisfying the ('; p)-Dunkl Lipschitz condition in the space Lp(Rd;wl(x)dx), 1 < p 6 2, where wl is a weight function invariant under the action of an associated re ection group.

متن کامل

Axiomatizing Re ective Logics and Languages

The very success and breadth of re ective techniques underscores the need for a general theory of re ection. At present what we have is a wide-ranging variety of re ective systems, each explained in its own idiosyncratic terms. Metalogical foundations can allow us to capture the essential aspects of re ective systems in a formalismindependent way. This paper proposes metalogical axioms for re e...

متن کامل

Reflection principles in computational logic

Dell'Acqua, P. 1998: Re ection Principles in Computational Logic, Uppsala Theses in Computing Science 30. 154pp. Uppsala. ISSN 0283-359X, ISBN 91-5061298-0. We introduce the concept of re ection principles as a knowledge representation paradigm in a computational logic setting. Re ection principles are expressed as certain kinds of logic schemata intended to capture the basic properties of the ...

متن کامل

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

A List - machine Benchmark for Mechanized Metatheory ( Extended Abstract ) Andrew

We propose a benchmark to compare theorem-proving systems on their ability to express proofs of compiler correctness. In contrast to the first POPLmark, we emphasize the connection of proofs to compiler implementations, and we point out that much can be done without binders or alpha-conversion. We propose specific criteria for evaluating the utility of mechanized metatheory systems; we have con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995